Automated Search for Round 1 Differentials for SHA-1: Work in Progress
نویسندگان
چکیده
Wang, Yin and Yu [24] describe a high probability differential path for SHA-1. Since then, various researchers have proposed techniques for improving the speed of finding collisions based on existing differential paths. The speed could be further improved by finding differentials through Round 1 (the first 20 steps) that are optimized to the particular technique. This paper describes progress on an automated search for finding differential paths
منابع مشابه
Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE
At CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulation of advanced meet-in-the-middle techniques for preimage attacks on hash functions. They demonstrated the usefulness of their approach by significantly improving the previously best known attacks on SHA-1 from CRYPTO 2009, increasing the number of attacked rounds from a 48-round one-block pseudo-preimage without paddi...
متن کاملDeterministic Differential Properties of the Compression Function of BMW
In this paper, we give some determinstic differential properties for the compression function of SHA-3 candidate Blue Midnight Wish (tweaked version for round 2). The computational complexity is about 2 compression function calls. This applies to security parameters 0/16, 1/15, and 2/14. The efficient differentials can be used to find pseudo-preimages of the compression function with marginal g...
متن کاملDeterministic Differential Properties of the BMW Compression Function
In this paper, we give some determinstic differential properties for the compression function of SHA-3 candidate Blue Midnight Wish (tweaked version for round 2). The computational complexity is about 2 compression function calls. This applies to security parameters 0/16, 1/15, and 2/14. The efficient differentials can be used to find pseudo-preimages of the compression function with marginal g...
متن کاملNear-Collisions on the Reduced-Round Compression Functions of Skein and BLAKE
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, including Skein and BLAKE, both of which have components based on modular addition, rotation and bitwise XOR (ARX). In this paper, we propose improved near-collision attacks on the reduced-round compression functions ...
متن کاملA New Related-Key Boomerang Distinguishing Attack of Reduced-Round Threefish-256
On Nov 2007, NIST announced the SHA-3 competition to select a new hash standard as a replacement of SHA-2. On Dec 2010, five submissions have been selected as the final round candidates, including Skein, which have components based on ARX. In this paper, a new related-key boomerang distinguishing attack is proposed on 31-round Threefish-256 with a time complexity of about 2234. Our improved att...
متن کامل